Probabilistic Modeling of Mobile Agents' Trajectories

نویسندگان

  • Stepán Urban
  • Michal Jakob
  • Michal Pechoucek
چکیده

We present a method for learning characteristic motion patterns of mobile agents. The method works on two levels. On the first level, it uses the expectation-maximization algorithm to build a Gaussian mixture model of the spatial density of agents’ movement. On the second level, agents’ trajectories as expressed as sequences of the components of the mixture model; the sequences are subsequently used to train hidden Markov models. The trained hidden Markov models are then employed to determine agent type, predict further agent movement or detect anomalous agents. The method has been evaluated in the maritime domain using ship trajectory data generated by the AgentC maritime traffic simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Analysis for Measuring Errors in Wheeled Mobile Robots (RESEARCH NOTE)

This paper presents experimental analysis of wheeled mobile robots. Mathematical modelling of the mobile robot is presented. The mobile robots consist of an omni-directional and three differential drive mobile robots are tested and moved in given trajectories and the systematic errors of the robots are determined. A new method for omni-direction mobile robot was introduced in which the robot wa...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

Optimal Trajectory Planning of a Box Transporter Mobile Robot

This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

متن کامل

Mobile Agent Trajectory Prediction using Bayesian Nonparametric Reachability Trees

This paper presents an efficient trajectory prediction algorithm that has been developed to improve the performance of future collision avoidance and detection systems. The main idea is to embed the inferred intention information of surrounding agents into their estimated reachability sets to obtain a probabilistic description of their future paths. More specifically, the proposed approach comb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010